Finite state automata representing two-dimensional subshifts
نویسندگان
چکیده
منابع مشابه
Finite State Automata Representing Two-Dimensional Subshifts
A new type of two-dimensional automaton has been defined to recognize a class of twodimensional shifts of finite type having the property that every admissible block found within the related local picture language can be extended to a point of the subshift. Here it is shown that this automaton accurately represents the image of the represented twodimensional shift of finite type under a block c...
متن کاملTwo-dimensional Jumping Finite Automata
In this paper, we extend a newly introduced concept called the jumping finite automata for accepting string languages to two-dimensional jumping finite automata for accepting two-dimensional languages. We discuss some of the basic properties of these automata and compare the family of languages accepted by these automata with the family of Siromoney matrix languages and also recognizable pictur...
متن کاملThe Spatial Entropy of Two-Dimensional Subshifts of Finite Type
In this paper, two recursive formulas for computing the spatial entropy of two-dimensional subshifts of finite type are given. The exact entropy of a nontrivial example arising in cellular neural networks is obtained by using such formulas. We also establish some general theory concerning the spatial entropy of two-dimensional subshifts of finite type. In particular, we show that if either of t...
متن کاملHierarchy and Expansiveness in Two-Dimensional Subshifts of Finite Type
Subshifts are sets of configurations over an infinite grid defined by a set of forbidden patterns. In this thesis, we study two-dimensional subshifts of finite type (2D SFTs), where the underlying grid is Z and the set of forbidden patterns is finite. We are mainly interested in the interplay between the computational power of 2D SFTs and their geometry, examined through the concept of expansiv...
متن کاملSimulation of Effective Subshifts by Two-dimensional Subshifts of Finite Type
In this article we study how a subshift can simulate another one, where the notion of simulation is given by operations on subshifts inspired by the dynamical systems theory (factor, projective subaction...). There exists a correspondence between the notion of simulation and the set of forbidden patterns. The main result of this paper states that any effective subshift of dimension d – that is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.03.015